On the limiting distribution of additive arithmetic functions

Functional Analysis and Additive Arithmetic Functions

1. A function is arithmetic if it is defined on the positive integers. Those arithmetic functions which assume real values and satisfy f(ab)-f(a)+f(b) for mutually prime integers a, b are classically called additive. The following examples illustrate the interest of these functions, both for themselves and for their applications. An additive function is defined by its values on the prime powers...

On the concentration of distribution of additive functions

1. We say that g(n) is additive if g(mn)=g(m)+g(n) holds for every coprime pairs m, n of positive integers . If, moreover, g(p') =g(p)' for every prime power pa , then g(n) is called strongly additive . By p, pi , p2 , . . ., q, qr , q2 , . . . we denote prime numbers, c, Cl, c2i . . . are suitable positive constants . F(n) and x(n) denote the largest and the smallest prime factor of n . The sy...

THE JOINT DISTRIBUTION OF q-ADDITIVE FUNCTIONS

On the value distribution of a class of arithmetic functions

This article deals with the value distribution of multiplicative prime-independent arithmetic functions (α(n)) with α(n) = 1 if n is N-free (N ≥ 2 a fixed integer), α(n) > 1 else, and α(2) → ∞. An asymptotic result is established with an error term probably definitive on the basis of the present knowledge about the zeros of the zetafunction. Applications to the enumerative functions of Abelian ...

study of hash functions based on chaotic maps

توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...